Fine approximation of convex bodies by polytopes
نویسندگان
چکیده
منابع مشابه
Fine Approximation of Convex Bodies by Polytopes
We prove that for every convex body K with the center of mass at the origin and every ε ∈ ( 0, 12 ) , there exists a convex polytope P with at most eO(d)ε− d−1 2 vertices such that (1− ε)K ⊂ P ⊂ K.
متن کاملRandom Polytopes, Convex Bodies, and Approximation
Assume K ⊂ R is a convex body and Xn ⊂ K is a random sample of n uniform, independent points from K. The convex hull of Xn is a convex polytope Kn called random polytope inscribed in K. We are going to investigate various properties of this polytope: for instance how well it approximates K, or how many vertices and facets it has. It turns out that Kn is very close to the so called floating body...
متن کاملAsymptotic approximation of smooth convex bodies by general polytopes
For the optimal approximation of convex bodies by inscribed or circumscribed polytopes there are precise asymptotic results with respect to different notions of distance. In this paper we want to derive some results on optimal approximation without restricting the polytopes to be inscribed or circumscribed. Let Pn and P(n) denote the set of polytopes with at most n vertices and n facets, respec...
متن کاملApproximation of Smooth Convex Bodies by Random Circumscribed Polytopes
Choose n independent random points on the boundary of a convex body K ⊂Rd . The intersection of the supporting halfspaces at these random points is a random convex polyhedron. The expectations of its volume, its surface area and its mean width are investigated. In the case that the boundary of K is sufficiently smooth, asymptotic expansions as n→∞ are derived even in the case when the curvature...
متن کاملThrifty approximations of convex bodies by polytopes
Given a convex body C ⊂ Rd containing the origin in its interior and a real number τ > 1 we seek to construct a polytope P ⊂ C with as few vertices as possible such that C ⊂ τP . Our construction is nearly optimal for a wide range of d and τ . In particular, we prove that if C = −C then for any 1 > > 0 and τ = 1 + one can choose P having roughly −d/2 vertices and for τ = √ d one can choose P ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Mathematics
سال: 2020
ISSN: 1080-6377
DOI: 10.1353/ajm.2020.0018